THE DIOPHANTINE EQUATION x2+2k =yn, II
نویسنده
چکیده
New results regarding the full solution of the diophantine equationx2+2k=yn in positive integers are obtained. These support a previous conjecture, without providing a complete proof.
منابع مشابه
On the Exponential Diophantine Equation
Let a, b, c be fixed positive integers satisfying a2 + ab + b2 = c with gcd(a, b) = 1. We show that the Diophantine equation a2x+axby+b2y = cz has only the positive integer solution (x, y, z) = (1, 1, 1) under some conditions. The proof is based on elementary methods and Cohn’s ones concerning the Diophantine equation x2 + C = yn. Mathematics Subject Classification: 11D61
متن کاملThe Periodic Character of a Rational Difference Equation 3
with y−s, y−s+1, . . . , y−1 ∈ (0,∞) and k, m ∈ {1, 2, 3, 4, . . .}, where s = k+m. We prove that if gcd(2k,m) = 1, then solutions to this equation are asymptotically 2k-periodic. This generalizes the corresponding result for m = 3 and k = 1, proved in K. S. Berenhaut et al., Periodic Solutions of the Rational Difference Equation yn = yn−3+yn−4 yn−1 ,Journal of Difference Equations and Applicat...
متن کاملON THE DIOPHANTINE EQUATION x + y = 2pz
We show, if p is prime, that the equation xn + yn = 2pz2 has no solutions in coprime integers x and y with |xy| ≥ 1 and n > p132p , and, if p 6= 7, the equation xn + yn = pz2 has no solutions in coprime integers x and y with |xy| ≥ 1 and n > p12p .
متن کاملPell ’ s Equation
An arbitrary quadratic diophantine equation with two unknowns can be reduced to a Pell-type equation. How can such equations be solved? Recall that the general solution of a linear diophantine equation is a linear function of some parameters. This does not happen with general quadratic diophantine equations. However, as we will see later, in the case of such equations with two unknowns there st...
متن کاملOn the Diophantine Equation
In this paper, we study the Diophantine equation x2 + C = 2yn in positive integers x, y with gcd(x, y) = 1, where n ≥ 3 and C is a positive integer. If C ≡ 1 (mod 4) we give a very sharp bound for prime values of the exponent n; our main tool here is the result on existence of primitive divisors in Lehmer sequence due Bilu, Hanrot and Voutier. When C 6≡ 1 (mod 4) we explain how the equation can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999